/**
* @author AlbertDarren
* @contact 2563491540@qq.com
*/
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;

int main_8()
{
    queue<int,deque<int>> qu;
    qu.push(-3);
    qu.push(1);
    qu.push(6);
    qu.push(-5);
    qu.push(7);
    while (!qu.empty())
    {
        cout << "The first element of queue is "<<qu.front() << endl;
        cout << "The last element of queue is "<<qu.back() << endl;
        cout << "The size of queue is "<<qu.size() << endl;
        qu.pop();
    }

	return 0;
}
